A Compact Goal-Independent Bottom-Up Fixpoint Modeling of the Behavior of TCCP

The Timed Concurrent Constraint Language (tccp in short) is a concurrent logic language based on the simple but powerful concurrent constraint paradigm of Saraswat. In this paradigm, the notion of store-asvalue is replaced by the notion of store-as-constraint, which introduces some differences w.r.t. other approaches to concurrency. In this work, we present a new compact, bottom-up semantics for the language that is well suited for abstract interpretation based debugging and verification purposes in the context of reactive systems. The defined semantics is shown to be correct w.r.t. the behavior of tccp. We also propose a an abstract semantics that allows us to effectively implement debugging algorithms based on abstract interpretation. This semantics keeps the particular strong synchronization characteristic of the language.